The lowest-possible BER and FER for any memoryless channel with given capacity
نویسندگان
چکیده
We consider coded transmission over a memoryless channel with some fixed capacity C and derive properties of channel coding schemes leading to the lowest bit error rate and frame error rate, respectively. The resulting overall optimum channels (including encoder, underlying channel, and decoder) behave like a binary symmetric channel and a fully bursty channel (block binary erasure channel), respectively.
منابع مشابه
Gaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملA Theory of Network Equivalence - Part I: Point-to-Point Channels
A family of equivalence tools for bounding network capacities is introduced. Given a network with node set , the capacity of is a set of non-negative vectors with elements corresponding to all possible multicast connections in ; a vector is in the capacity region for if and only if it is possible to simultaneously and reliably establish all multicast connections across at the given rates. Any o...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملCapacity-Achievability of Polar Codes under Successive Cancellation List Decoding
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...
متن کاملSource-channel rate allocation for progressive transmission of images
Progressive image transmission is difficult in the presence of a noisy channel, mainly due to the propagation of errors during the decoding of a progressive bitstream. Excellent results for this problem are made possible through combined source-channel coding – a method that matches the channel code to the source operational rate-distortion as well as channel conditions. This paper focuses on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0801.1067 شماره
صفحات -
تاریخ انتشار 2008